A Formal Model for Eventual Consistency Semantics

نویسندگان

  • Anne-Marie Bosneag
  • Monica Brockmeyer
چکیده

Wide-area replicated systems are characterized by a conflict between performance, availability and consistency. As a consequence, “one-size-fits-all” approaches will inadequately address every situation. Therefore, there is a need for a formalism that can be used to express consistency requirements in a uniform way, as well as for new algorithms and techniques appropriate for the wide-area setting. This paper takes advantage of dependency relations between operations for improving the classic algorithm for eventual consistency and proposes a formal model used for reasoning about the correctness of the algorithm. The proposed algorithm reduces the number of undo operations when independence between operations can be exploited. The formal model allows us to describe and reason about replication and consistency semantics in a formal manner. The new algorithm provides good results when dependence relations between operations can be identified.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Understanding Eventual Consistency

Modern geo-replicated databases underlying large-scale In-ternet services guarantee immediate availability and tolerate networkpartitions at the expense of providing only weak forms of consistency,commonly dubbed eventual consistency. At the moment there is a lotof confusion about the semantics of eventual consistency, as differentsystems implement it with different sets of ...

متن کامل

Representation without Taxation: A Uniform, Low-Overhead, and High-Level Interface to Eventually Consistent Key-Value Stores

Geo-distributed web applications often favor high availability over strong consistency. In response to this bias, modern-day replicated data stores often eschew sequential consistency in favor of weaker eventual consistency (EC) data semantics. While most operations supported by a typical web application can be engineered, with sufficient care, to function under EC, there are oftentimes critica...

متن کامل

Consistency in Distributed Data Stores

This paper focuses on the problem of consistency in distributed data stores. We define strong consistency model which provides a simple semantics for application programmers, but impossible to achieve with availability and partition-tolerance. We also define weaker consistency models including causal and eventual consistency. We review COPS and GentleRain as two causally consistent data stores ...

متن کامل

A framework for establishing Strong Eventual Consistency for Conflict-free Replicated Datatypes

In this work, we focus on the correctness of Conflict-free Replicated Data Types (CRDTs), a class of algorithm that provides strong eventual consistency guarantees for replicated data. We develop a modular and reusable framework for verifying the correctness of CRDT algorithms. We avoid correctness issues that have dogged previous mechanised proofs in this area by including a network model in o...

متن کامل

Bulletin of the European Association for Theoretical Computer

Eventual consistency aims to ensure that replicas of some mutable shared object converge without foreground synchronisation. Previous approaches to eventual consistency are ad-hoc and error-prone. We study a principled approach: to base the design of shared data types on some simple formal conditions that are sufficient to guarantee eventual consistency. We call these types Convergent or Commut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002